Conditioning, updating and lower probability zero
نویسندگان
چکیده
We discuss the issue of conditioning on events with probability zero within an imprecise-probabilistic setting, where it may happen that the conditioning event has lower probability zero, but positive upper probability. In this situation, two different conditioning rules are commonly used: regular extension and natural extension. We explain the difference between them and discuss various technical and computational aspects. Both conditioning rules are often used to update an imprecise belief model after receiving the information that some event O has occurred, simply by conditioning on O, but often little argumentation is given as to why such an approach would make sense. We help to address this problem by providing a firm foundational justification for the use of natural and regular extension as updating rules. Our results are presented in three different, closely related frameworks: sets of desirable gambles, lower previsions, and sets of probabilities. What makes our justification especially powerful is that it avoids making some of the unnecessary strong assumptions that are traditionally adopted. For example, we do not assume that lower and upper probabilities provide bounds on some ‘true’ probability mass function, on which we can then simply apply Bayes’s rule. Instead a subject’s lower probability for an event O is taken to be the supremum betting rate at which he is willing to bet on O, and his upper probability is the infimum betting rate at which he is willing to take bets on O; we do not assume the existence of a fair betting rate that lies in between these bounds.
منابع مشابه
Coherent updating on finite spaces
We compare the different notions of conditional coherence within the behavioural theory of imprecise probabilities when all the spaces are finite. We show that the differences between the notions are due to conditioning on sets of (lower, and in some cases upper) probability zero. Next, we characterise the range of coherent extensions, proving that the greatest coherent extensions can always be...
متن کاملAlgorithms for Conditioning on Events of Zero Lower Probability
This paper presents techniques for computing conditional lower expectations through sequences of pivoting operations, for conditioning events with positive or zero lower/upper probability. The algorithms depart from the sequences of linear programs currently employed in the literature.
متن کاملUnpredictability, Probability Updating and the Three Prisoners Paradox
This paper discusses the Three Prisoners paradox in the light of three different procedures for the updating of probabilities Bayesian conditioning, superconditioning and Jeffrey's rule as well as assuming the unpredictability of receipt of information by prisoner A. The formulation of the paradox in this temporal setting brings new insight to the problem and, on the other hand, the paradox is ...
متن کاملNonlinear lap joint interface modeling and updating strategies for assembled structures
A comparison between two known strategies of modeling lap joint interfaces, namely, zero-thickness and thin layer interface theories and their associated updating procedures, is made. Finite element...
متن کاملUpdating Sets of Probabilities
There are several well-known justifications for conditioning as the appropriate method for updating a single probability measure, given an observation. However, there is a significant body of work arguing for sets of probability measures, rather than single mea sures, as a more realistic model of uncer tainty. Conditioning still makes sense in this context-we can simply condition each mea su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 67 شماره
صفحات -
تاریخ انتشار 2015